On minimum degree conditions for supereulerian graphs

A graph is called supereulerian if it has a spanning closed trail. Let $G$ be a 2-edge-connected graph of order $n$ such that each minimal edge cut $E \subseteq E (G)$ with $|E| \le 3$ satisfies the property that each component of $G-E$ has order at least $(n-2)/5$. We prove that either $G$ is supereulerian or $G$ belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree $\delta\ge 4$: If $G$ is a 2-edge-connected graph of order $n$ with $\delta (G)\ge 4$ such that for every edge $xy\in E (G)$ , we have $\max \{d(x),d(y)\} \ge (n-7)/5$, then either $G$ is supereulerian or $G$ belongs to one of two classes of exceptional graphs. We show that the condition $\delta(G)\ge 4$ cannot be relaxed

Matrix models without scaling limit

In the context of hermitean one--matrix models we show that the emergence of the NLS hierarchy and of its reduction, the KdV hierarchy, is an exact result of the lattice characterizing the matrix model. Said otherwise, we are not obliged to take a continuum limit to find these hierarchies. We interpret this result as an indication of the topological nature of them. We discuss the topological field theories associated with both and discuss the connection with topological field theories coupled to topological gravity already studied in the literature.Comment: Latex, SISSA-ISAS 161/92/E

The (N,M)-th KdV hierarchy and the associated W algebra

We discuss a differential integrable hierarchy, which we call the (N, M)$--th KdV hierarchy, whose Lax operator is obtained by properly adding$M$pseudo--differential terms to the Lax operator of the N--th KdV hierarchy. This new hierarchy contains both the higher KdV hierarchy and multi--field representation of KP hierarchy as sub--systems and naturally appears in multi--matrix models. The N+2M-1 coordinates or fields of this hierarchy satisfy two algebras of compatible Poisson brackets which are {\it local} and {\it polynomial}. Each Poisson structure generate an extended W_{1+\infty} and W_\infty algebra, respectively. We call W(N, M) the generating algebra of the extended W_\infty algebra. This algebra, which corresponds with the second Poisson structure, shares many features of the usual$W_N$ algebra. We show that there exist M distinct reductions of the (N, M)--th KdV hierarchy, which are obtained by imposing suitable second class constraints. The most drastic reduction corresponds to the (N+M)--th KdV hierarchy. Correspondingly the W(N, M) algebra is reduced to the W_{N+M} algebra. We study in detail the dispersionless limit of this hierarchy and the relevant reductions.Comment: 40 pages, LaTeX, SISSA-171/93/EP, BONN-HE-46/93, AS-IPT-49/9

On stability of the Hamiltonian index under contractions and closures

The hamiltonian index of a graph $G$ is the smallest integer $k$ such that the $k$-th iterated line graph of $G$ is hamiltonian. We first show that, with one exceptional case, adding an edge to a graph cannot increase its hamiltonian index. We use this result to prove that neither the contraction of an $A_G(F)$-contractible subgraph $F$ of a graph $G$ nor the closure operation performed on $G$ (if $G$ is claw-free) affects the value of the hamiltonian index of a graph $G$

Toughness and hamiltonicity in kk-trees

We consider toughness conditions that guarantee the existence of a hamiltonian cycle in $k$-trees, a subclass of the class of chordal graphs. By a result of Chen et al.\ 18-tough chordal graphs are hamiltonian, and by a result of Bauer et al.\ there exist nontraceable chordal graphs with toughness arbitrarily close to $\frac{7}{4}$. It is believed that the best possible value of the toughness guaranteeing hamiltonicity of chordal graphs is less than 18, but the proof of Chen et al.\ indicates that proving a better result could be very complicated. We show that every 1-tough 2-tree on at least three vertices is hamiltonian, a best possible result since 1-toughness is a necessary condition for hamiltonicity. We generalize the result to $k$-trees for $k\ge 2$: Let $G$ be a $k$-tree. If $G$ has toughness at least $\frac{k+1}{3},$ then $G$ is hamiltonian. Moreover, we present infinite classes of nonhamiltonian 1-tough $k$-trees for each $k\ge 3

Fast Determination of Soil Behavior in the Capillary Zone Using Simple Laboratory Tests

INE/AUTC 13.1